Grokking Oracle Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
Oracle Easy
Count Number of Pairs With Absolute Difference K (easy)
Solution: Count Number of Pairs With Absolute Difference K
Degree of an Array (easy)
Solution: Degree of an Array
Find Subsequence of Length K With the Largest Sum (easy)
Solution: Find Subsequence of Length K With the Largest Sum
Rectangle Overlap (easy)
Solution: Rectangle Overlap
Remove All Adjacent Duplicates In String (easy)
Solution: Remove All Adjacent Duplicates In String
Island Perimeter (easy)
Solution: Island Perimeter
Climbing Stairs (easy)
Solution: Climbing Stairs
Move Zeroes (easy)
Solution: Move Zeroes
Excel Sheet Column Title (easy)
Solution: Excel Sheet Column Title
Valid Parentheses (Easy)
Solution: Valid Parentheses
Oracle Medium
Longest Palindromic Substring (medium)
Solution: Longest Palindromic Substring
Single Element in a Sorted Array (medium)
Solution: Single Element in a Sorted Array
Pairs of Songs With Total Durations Divisible by 60 (medium)
Solution: Pairs of Songs With Total Durations Divisible by 60
Search a 2D Matrix II (medium)
Solution: Search a 2D Matrix II
Minimize Maximum of Array (medium)
Solution: Minimize Maximum of Array
Asteroid Collision (medium)
Solution: Asteroid Collision
Combination Sum (medium)
Solution: Combination Sum
Binary Tree Right Side View (medium)
Solution: Binary Tree Right Side View
Sort Colors (medium)
Solution: Sort Colors
Group Anagrams (Medium)
Solution: Group Anagrams
Decode String (Medium)
Solution: Decode String
Number of Islands (medium)
Solution: Number of Islands
Binary Tree Zigzag Level Order Traversal (medium)
Solution: Binary Tree Zigzag Level Order Traversal
Longest Common Subsequence (medium)
Solution: Longest Common Subsequence
Rotting Oranges (medium)
Solution: Rotting Oranges
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Spiral Matrix (medium)
Solution: Spiral Matrix
Container With Most Water (Medium)
Solution: Container With Most Water
3Sum (medium)
Solution: 3Sum
Simplify Path (medium)
Solution: Simplify Path
Next Permutation (medium)
Solution: Next Permutation
Basic Calculator II (medium)
Solution: Basic Calculator II
Merge Intervals (medium)
Solution: Merge Intervals
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Longest Increasing Subsequence (medium)
Solution: Longest Increasing Subsequence
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Integer to English Words (hard)
Solution: Integer to English Words
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Merge K Sorted Lists (hard)
Solution: Merge K Sorted Lists
Max Points on a Line (hard)
Solution: Max Points on a Line
Sudoku Solver (hard)
Solution: Sudoku Solver
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Constrained Subsequence Sum (hard)
Solution: Constrained Subsequence Sum
Solution: Asteroid Collision

Problem Statement

You are given an integer array asteroids of size n, where asteroids[i] represents the size and direction of the ith asteroid.

The size of an asteroid is represented by the absolute value of asteroids[i], and its direction is indicated by the integer's sign: positive for rightward and negative for leftward. Each asteroid moves at the same speed.

When two asteroids collide, the smaller one shatters. If they are of equal size, both are destroyed. Asteroids moving in the same direction never collide.

Return the final state of asteroids after all possible collisions have been resolved.

Examples

  • Example 1:

    • Input: asteroids = [8, -3, 4, -5]
    • Expected Output: [8]
    • Justification: The asteroid 4 collides with -5, and since -5 is larger, 4 is destroyed. Next, -3 and -5 get destroyed when they collide with 8.
  • Example 2:

    • Input: asteroids = [-2, -1, 1, 2]
    • Expected Output: [-2, -1, 1, 2]
    • Justification: Since the asteroids are moving in opposite directions, there are no collisions.
  • Example 3:

    • Input: asteroids = [5, -3, 8, -2, -4, 1, -1]
    • Expected Output: [5, 8]
    • Justification: The sequence of interactions is as follows:
      • 5 and -3 collide, and -3 will get destroyed.
      • 8 and -2 collide, and -2 will get destroyed.
      • -4 will be destroyed after collision with 8.
      • 1 and -1 collide and both are destroyed because they have the same magnitude but opposite directions.
      • The final configuration is [5, 8], as these asteroids survive without further collisions.

Constraints:

  • 2 <= asteroids.length <= 104
  • -1000 <= asteroids[i] <= 1000
  • asteroids[i] != 0

Solution

To solve this problem, we'll use a stack to keep track of the asteroids. This approach works because the problem inherently deals with a sequence of elements where the most recent element might only interact with the one directly before it, which is a perfect scenario for a stack.

When an asteroid moves right (positive), we push it onto the stack. When an asteroid moves left (negative), we compare it with the top of the stack. If the top is moving right, we determine the outcome of the collision. If the asteroid moving left survives, we continue comparing it with the new top of the stack until it either destroys all opposing asteroids or is destroyed itself. This method ensures we only keep asteroids that have survived all possible collisions, effectively simulating the process described in the problem.

Step-by-Step Algorithm

  1. Initialize a Stack: Create an empty stack to keep track of the asteroids that are moving or have the potential to cause collisions.

  2. Iterate Through Asteroids: Loop through each asteroid in the given array.

    • For each asteroid, check if it is moving left (negative value) and if there are any asteroids in the stack moving right (positive value at the top of the stack).
  3. Handle Collisions:

    • If the current asteroid is moving left and the top of the stack is moving right, a collision might occur. Enter a while loop to handle this potential collision.
      • Destroy Bigger Asteroid: Compare the absolute values of the current asteroid and the one at the top of the stack. If the current asteroid is larger, pop the top of the stack (the right-moving asteroid is destroyed), and continue to the next iteration to check for more potential collisions.
      • Equal Size Destruction: If the asteroids are of equal size, pop the top of the stack and set the current asteroid to 0 (indicating it has been handled), then break out of the while loop since both asteroids destroy each other.
      • Smaller Asteroid Destroyed: If the current asteroid is smaller, simply set it to 0 (indicating it has been handled) and break out of the while loop.
  4. Stack Update:

    • After handling collisions, if the current asteroid is not set to 0 (indicating it has survived or is moving right without any opposing asteroids), push it onto the stack.
  5. Convert Stack to List:

    • Once all asteroids have been processed, convert the stack to a list to represent the final state of the asteroid field.

Algorithm Walkthrough

Input: asteroids = [5, -3, 8, -2, -4, 1, -1]

  1. Start with an empty stack: []

  2. Process 5:

    • 5 is moving right, no asteroids to collide with.
    • Stack after processing 5: [5]
  3. Process -3:

    • -3 is moving left and encounters 5 moving right.
    • Since 3 is smaller than 5, -3 is destroyed.
    • Stack remains unchanged: [5]
  4. Process 8:

    • 8 is moving right, no asteroids to collide with.
    • Stack after processing 8: [5, 8]
  5. Process -2:

    • -2 is moving left and encounters 8 moving right.
    • Since 2 is smaller than 8, -2 is destroyed.
    • Stack remains unchanged: [5, 8]
  6. Process -4:

    • -4 is moving left and encounters 8 moving right.
    • Since 4 is smaller than 8, -4 is destroyed.
    • Stack remains unchanged: [5, 8]
  7. Process 1:

    • 1 is moving right, no immediate collision as the last asteroid (8) is also moving right.
    • Stack after processing 1: [5, 8, 1]
  8. Process -1:

    • -1 is moving left and encounters 1 moving right.
    • Since -1 and 1 are of equal size, both are destroyed.
    • Stack after processing -1 (removing 1): [5, 8]
  9. Final State:

    • The final configuration of the asteroid field is represented by the stack: [5, 8]

Code

Java

. . . .

Complexity Analysis

Time Complexity:

The time complexity of this algorithm is , where n is the number of asteroids. Each asteroid is processed exactly once when iterating through the array. The while loop inside the for loop might give an impression of a higher complexity, but each asteroid is pushed onto or popped from the stack at most once. The key insight is that an asteroid is either left on the stack or removed from consideration, ensuring that each operation (push or pop) is , and in total, we do not exceed operations.

Space Complexity:

The space complexity is due to the stack used to keep track of asteroids. In the worst-case scenario, all asteroids are moving in the same direction, and none are destroyed, requiring a stack that can hold all n asteroids.

Asteroid Collision (medium)
Combination Sum (medium)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-Step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis

Time Complexity:

Space Complexity: